AGD: A Library of Algorithms for Graph Drawing
نویسندگان
چکیده
منابع مشابه
A Library of Algorithms for Graph Drawing
The AGD library provides algorithms, data structures, and tools to create geometric representations of graphs and aims at bridging the gap between theory and practice in the area of graph drawing. It consists of C++ classes and is built on top of the library of efficient data types and algorithms LEDA; an optional add-on to AGD requires ABACUS, a framework for the implementation of branch-and-c...
متن کاملAgd{library: a Library of Algorithms for Graph Drawing 1
A graph drawing algorithm produces a layout of a graph in two-or three-dimensional space that should be readable and easy to understand. Since the aesthetic criteria diier from one application area to another, it is unlikely that a deenition of the \optimal drawing" of a graph in a strict mathematical sense exists. A large number of graph drawing algorithms taking different aesthetic criteria i...
متن کاملPlanar Polyline Drawings with Good Angular Resolution
We present a linear time algorithm that constructs a planar polyline grid drawing of any plane graph with n vertices and maximum degree d on a (2n ? 5) (3 2 n ? 7 2) grid with at most 5n ? 15 bends and minimum angle > 2 d. In the constructed drawings, every edge has at most three bends and length O(n). To our best knowledge, this algorithm achieves the best simultaneous bounds concerning the gr...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملHigres - Visualization System for Clustered Graphs and Graph Algorithms
We present the Higres system – a visualization tool, an editor for clustered graphs and a platform for execution and animation of graph algorithms. Higres can handle any attributed graphs and perform animated semantic processing of them. The semantics of a graph can be defined by the user in the graph editor. The user can also create new external modules to process graphs with defined semantics...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001